On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting
نویسندگان
چکیده
We develop quantum fingerprinting technique for constructing quantum branching programs (QBPs), which are considered as circuits with an ability to use classical bits as control variables. We demonstrate our approach constructing optimal quantum ordered binary decision diagram (QOBDD) for MODm Boolean function. The construction of our technique also allows to extend the recent result of Ambainis and Nahimovs it is based on. In addition we show how our technique works for encoding quantum information for the equality problem in the simultaneous message passing model.
منابع مشابه
Algorithms for Quantum Branching Programs Based on Fingerprinting
In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs). Our method is based on fingerprinting technique and representation of Boolean functions by their characteristic polynomials. We use circuit notation for branching programs for desired algorithms presentation. For several known func...
متن کاملOn Computational Power of Quantum Read-Once Branching Programs
In this paper we review our current results concerning the computational power of quantum read-once branching programs. First of all, based on the circuit presentation of quantum branching programs and our variant of quantum fingerprinting technique, we show that any Boolean function with linear polynomial presentation can be computed by a quantum read-once branching program using a relatively ...
متن کاملComplexity of Boolean Functions
s of Presentation: Paul Beame: Time-Space Tradeoffs and Multiparty Communication Complexity 9 Beate Bollig: Exponential Lower Bounds for Integer Multiplication Using Universal Hashing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Philipp Wölfel: On k-wise l-mixed Boolean Functions . . . . . . . . . . . . . . 10 Elizabeta Okol’nishnikova: On One Lower Bound for Branching Progra...
متن کاملOn the Computation Power of Randomized Branching Programs
We survey some upper and lower bounds established recently on the sizes of randomized branching programs computing explicit boolean functions In particular we display boolean functions on which randomized read once ordered branching programs are exponentially more powerful than deterministic or nondeterministic read k times branching programs for any k o n log n We investigate further computati...
متن کاملOn Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions
We consider Generalized Equality, the Hidden Subgroup, and related problems in the context of quantum Ordered Binary Decision Diagrams. For the decision versions of considered problems we show polynomial upper bounds in terms of quantum OBDD width. We apply a new modification of the fingerprinting technique and present the algorithms in circuit notation. Our algorithms require at most logarithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 15 شماره
صفحات -
تاریخ انتشار 2008